Bounds for the Co - PI Index of a Graph

نویسندگان

  • A. D. MADEN
  • ALI REZA ASHRAFI
چکیده

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for the Co-PI index of a graph

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

متن کامل

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

Bounds on First Reformulated Zagreb Index of Graph

The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.

متن کامل

On edge Co-PI indices

In this paper, at first we mention to some results related to PI and vertex Co-PI indices and then we introduce the edge versions of Co-PI indices. Then, we obtain some properties about these new indices.

متن کامل

Automatic graph construction of periodic open tubulene ((5,6,7)3) and computation of its Wiener, PI, and Szeged indices

The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the graph of this molecule and plot the graph by spring layout algorithm in graphviz and netwrokx packages. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015